Hamiltonian and pancyclic graphs in the class of self-centered graphs with radius two
نویسندگان
چکیده
منابع مشابه
New sufficient conditions for hamiltonian and pancyclic graphs
For a graph G of order n we consider the unique partition of its vertex set V (G) = A ∪ B with A = {v ∈ V (G) : d(v) ≥ n/2} and B = {v ∈ V (G) : d(v) < n/2}. Imposing conditions on the vertices of the set B we obtain new sufficient conditions for hamiltonian and pancyclic graphs.
متن کاملStrongly pancyclic and dual-pancyclic graphs
Say that a cycle C almost contains a cycle C− if every edge except one of C− is an edge of C. Call a graph G strongly pancyclic if every nontriangular cycle C almost contains another cycle C− and every nonspanning cycle C is almost contained in another cycle C. This is equivalent to requiring, in addition, that the sizes of C− and C differ by one from the size of C. Strongly pancyclic graphs ar...
متن کاملLocally Pancyclic Graphs
We prove the following theorem. Let G be a graph of order n and let W V(G). If |W | 3 and dG(x)+dG( y) n for every pair of non-adjacent vertices x, y # W, then either G contains cycles C , C, ..., C |W | such that C i contains exactly i vertices from W (i=3, 4, ..., |W | ), or |W |=n and G=Kn 2, n 2 , or else |W |=4, G[W]=K2, 2 . This generalizes a result of J. A. Bondy (1971, J. Combin. Theory...
متن کاملthe relationship of wtc with communication apprehension and self-perceived communication competene in english and persian context
بیشتر تحقیقات پیشین در زمینه تمایل به برقراری ارتباط به رابطه آن با عوامل فردی چون سن، جنس، نوع شخصیت و... صورت گرفته است. در صورتی که مطالعات کمتری به بررسی رابطه تمایل به برقراری ارتباط زبان آموزان فارسی زبان با ترس از برقراری ارتباط و توانش خود ادراکانه آنها در برقراری ارتباط در محیط فارسی و انگلیسی انجام شده است. بر اساس نظریه الیس (2008) تمایل به برقراری ارتباط جایگاه مهمی در زمینه آموزش م...
15 صفحه اولGeodesic-pancyclic graphs
A shortest path connecting two vertices u and v is called a u-v geodesic. The distance between u and v, denoted by dG(u, v), is the number of edges in a u-v geodesic. A graph G with n vertices is geodesic-pancyclic if for each pair of vertices u, v ∈ V (G), every u-v geodesic lies on every cycle of length k satisfying max{2dG(u, v), 3} ≤ k ≤ n. In this paper, we study the properties for graphs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2018
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2042